Similar Sublattices of Planar Lattices
نویسنده
چکیده
The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are discussed, with special emphasis on concrete results. In particular, we derive Dirichlet series generating functions for the number of distinct similar sublattices of a given index, and relate them to various zeta functions of orders in imaginary quadratic fields.
منابع مشابه
ar X iv : 1 21 0 . 05 71 v 1 [ m at h . M G ] 1 O ct 2 01 2 Well - rounded sublattices and coincidence site lattices
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs). Furthermore, we count the number of well-rounded sublattices for several planar lattices and give their asymptotic behaviour.
متن کاملWell-Rounded Zeta-Function of Planar Arithmetic Lattices
We investigate the properties of the zeta-function of well-rounded sublattices of a fixed arithmetic lattice in the plane. In particular, we show that this function has abscissa of convergence at s = 1 with a real pole of order 2, improving upon a result of [11]. We use this result to show that the number of well-rounded sublattices of a planar arithmetic lattice of index less or equal N is O(N...
متن کاملPlanar sublattices of FM ( 4 )
R. McKenzie, A. Kostinsky and B. J6nsson have proved the remarkable result that the class of finite sublattices of a free lattice and the class of finite projective lattices coincide [6]. I f we restrict ourselves to modular lattices, the above result is no longer true. Examining the map from the free modular lattice on three generators, FM(3), to the free distributive lattice on three generato...
متن کاملSimilar Submodules and Coincidence Site Modules
We consider connections between similar sublattices and coincidence site lattices and, more generally, between similar submodules and coincidence site modules of general (free) Z-modules in R. In particular, we generalise results obtained by S. Glied and M. Baake on similarity and coincidence isometries of lattices and certain lattice-like modules called S-modules. An important result is that t...
متن کاملOn the decomposition of lattices
A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decomposable. We present an algorithm to construct a lattice’s decomposition into indecomposable sublattices. Similar methods are used to prove a covering theorem for generating systems of lattices and to speed up variations of the LLL algorithm for the computation of lattice bases from large generating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009